Handling Deceptive Problems Using a Different Genetic Search

نویسنده

  • Dipankar Dasgupta
چکیده

|In recent years, several studies have been devoted to the design of problems with diierent degrees of deception in order to investigate the performance of GAs. This paper presents a diierent genetic approach, called the Structured Genetic Algorithm (sGA) for solving GA-deceptive problems. The Structured GA uses an hierarchical encoding and a gene expression mechanism in its overspeciied chro-mosomal representation. The paper reported some experimental results which demonstrated that on using a diierent chromosomal representation (as in sGA), the genetic search becomes more robust and can easily handle so-called GA-deceptive problems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Handling Deceptive Problems Using a Diierent Genetic Search

|In recent years, several studies have been devoted to the design of problems with diierent degrees of deception in order to investigate the performance of GAs. This paper presents a diierent genetic approach, called the Structured Genetic Algorithm (sGA) for solving GA-deceptive problems. The Structured GA uses an hierarchical encoding and a gene expression mechanism in its overspeciied chro-m...

متن کامل

Fundamental Principles of Deception in Genetic Search

This paper presents several theorems concerning the nature of deception and the central role that deception plays in function optimization using genetic algorithms. A simple proof is ooered which shows that the only problems which pose challenging optimization tasks are problems that involve some degree of deception and which result in connicting k-arm bandit competitions between hyperplanes. T...

متن کامل

Adaptive Group Mutation for Tackling Deception in Genetic Search

In order to study the efficacy of genetic algorithms (GAs), a number of fitness landscapes have been designed and used as test functions. Among these functions a family of deceptive functions have been developed as difficult test functions for comparing different implementations of GAs. In this paper an adaptive group mutation (AGM), which can be combined with traditional bit mutation in GAs, i...

متن کامل

Novelty-Driven Particle Swarm Optimization

Particle Swarm Optimization (PSO) is a well-known population-based optimization algorithm. Most often it is applied to optimize objective-based fitness functions that reward progress towards a desired objective or behavior. As a result, search increasingly focuses on higherfitness areas. However, in problems with many local optima, such focus often leads to premature convergence that precludes ...

متن کامل

A Continuous Plane Model to Machine Layout Problems Considering Pick-Up and Drop-Off Points: An Evolutionary Algorithm

One of the well-known evolutionary algorithms inspired by biological evolution is genetic algorithm (GA) that is employed as a robust and global optimization tool to search for the best or near-optimal solution with the search space. In this paper, this algorithm is used to solve unequalsized machines (or intra-cell) layout problems considering pick-up and drop-off (input/output) points. Such p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994